algorithmic description

См. также в других словарях:

• algorithmic description — algoritminis aprašas statusas T sritis automatika atitikmenys: angl. algorithmic description vok. algorithmische Beschreibung, f rus. алгоритмическое описание, n pranc. description algorithmique, f …   Automatikos terminų žodynas

• description algorithmique — algoritminis aprašas statusas T sritis automatika atitikmenys: angl. algorithmic description vok. algorithmische Beschreibung, f rus. алгоритмическое описание, n pranc. description algorithmique, f …   Automatikos terminų žodynas

• Algorithmic information theory — is a subfield of information theory and computer science that concerns itself with the relationship between computation and information. According to Gregory Chaitin, it is the result of putting Shannon s information theory and Turing s… …   Wikipedia

• Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… …   Wikipedia

• Hardware description language — In electronics, a hardware description language or HDL is any language from a class of computer languages and/or programming languages for formal description of electronic circuits. It can describe the circuit s operation, its design and… …   Wikipedia

• Minimum description length — The minimum description length (MDL) principle is a formalization of Occam s Razor in which the best hypothesis for a given set of data is the one that leads to the best compression of the data. MDL was introduced by Jorma Rissanen in 1978. It is …   Wikipedia

• High-level synthesis — (HLS), sometimes referred to as C synthesis, electronic system level (ESL) synthesis, algorithmic synthesis, or behavioral synthesis, is an automated design process that interprets an algorithmic description of a desired behavior and creates… …   Wikipedia

• Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia

• Comment (computer programming) — For comments in Wikipedia markup, see Help:Wiki markup#Character formatting and WP:COMMENT. An illustration of Java source code with prologue comments indicated in red and inline comments in green. Program code is in blue …   Wikipedia

• algorithmische Beschreibung — algoritminis aprašas statusas T sritis automatika atitikmenys: angl. algorithmic description vok. algorithmische Beschreibung, f rus. алгоритмическое описание, n pranc. description algorithmique, f …   Automatikos terminų žodynas

• algoritminis aprašas — statusas T sritis automatika atitikmenys: angl. algorithmic description vok. algorithmische Beschreibung, f rus. алгоритмическое описание, n pranc. description algorithmique, f …   Automatikos terminų žodynas